On Unique Decodability
نویسندگان
چکیده
منابع مشابه
Unique decodability of bigram counts by finite automata
We revisit the problem of deciding whether a given string is uniquely decodable from its bigram counts by means of a finite automaton. An efficient algorithm for constructing a polynomial-size nondeterministic finite automaton that decides unique decodability is given. Conversely, we show that the minimum deterministic finite automaton for deciding unique decodability has at least exponentially...
متن کاملOn Unique Decodability, McMillan’s Theorem and the Expected Length of Codes
In this paper we propose a revisitation of the topic of unique decodability and of some of the related fundamental theorems. It is widely believed that, for any discrete source X, every “uniquely decodable” block code satisfies E[l(X1, X2, · · · , Xn)] ≥ H(X1, X2, . . . , Xn), where X1, X2, . . . , Xn are the first n symbols of the source, E[l(X1, X2, · · · , Xn)] is the expected length of the ...
متن کاملOn the Unique Decodability of Insertion-Correcting Codes Beyond the Guarantee
Unlike the space of received words generated by substitution errors, the space of received words generated by insertion errors is infinite. Given an arbitrary code, it is possible for there to exist an infinite number of received words that are unique to a particular codeword. This work explores the extent to which an arbitrary insertion-correcting code can take advantage of this fact. Such que...
متن کاملOn α-decodability and α-likelihood decoder
Generalizing the maximum and the average error criteria for channel coding, we introduce the α-decodability, defined as the α-norm of the probabilities of correctly decoding the messages. Several aspects, such as the exponent, the existence of a strong Fano’s inequality, and the achievability of the channel capacity by random coding are investigated, and it is revealed that α “ 0 (corresponding...
متن کاملList decodability at small radii
A′(n,d,e), the smallest ` for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size ` up to radius e, is determined for all d ≥ 2e−3. As a result, A′(n,d,e) is determined for all e≤ 4, except for 42 values of n.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2008
ISSN: 0018-9448
DOI: 10.1109/tit.2008.929941